In this paper , a lot of researches and exploration are applied to studying the universality and expansibility of hardware and the arithmetic design and code optimization of software . especially , all of the following arithmetics or conceptions are worked out in the research of software design : self - adaptable compression arithmetic based on dictionary model for data collection system , similarity full binary sort tree , a optimized quick search arithmetic and an improved arithmetic of multiplication in the floating - point operation . and all of the arithmetic are designed with mcs - 51 assembly language . the quick search arithmetic , in which merits of both binary search and sequence search are used fully , are based on the specialty of preorder traversal in similarity full binary sort tree 特別在軟件設(shè)計(jì)研究中,提出了適用于數(shù)據(jù)采集系統(tǒng)的數(shù)據(jù)壓縮算法? ?基于字典模型的自適應(yīng)壓縮算法;提出了類滿二叉排序樹(shù)的定義;提出了基于類滿二叉排序樹(shù)的先序遍歷特性的最優(yōu)化快速查找算法,它充分利用了折半查找和順序查找各自的優(yōu)點(diǎn);提出了浮點(diǎn)運(yùn)算乘法的改進(jìn)算法;并在mcs - 51匯編語(yǔ)言層次上對(duì)所有的算法加以實(shí)現(xiàn)。